Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

单级入轨运载器干质量影响因素分析

提出了单级入轨运载器干质量计算方法。对给定的飞行任务,提出了基准运载器,并计算了贮箱材料、热防护系统及设计余量对运载器干质量的影响。计算结果表明,先进的材料和设计能降低运载器的干质量,并使运载器干质量对设计余量的敏感性降低     

一种消除直线永磁无刷直流电机边端效应对换相时机影响的方法

电磁弹射用直线永磁无刷直流电机的永磁体动子具有开断结构,使动子边端的磁场分布发生变形。当采用霍尔元件检测磁场实现换相时,这种边端效应就会影响换相时机。分析了这类电机的换相机理和动子开断结构对换相时机的影响,指出这类边端效应受极弧系数影响显著,并提出了利用不对称滞环比较器或简易单限比较器对霍尔输出信号进行处理从而消除这类边端效应影响的方法,实验验证了简易单限比较器方案的可行性。     

A note on combined job selection and sequencing problems

We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n²) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n²) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013     

A PANEL DATA ANALYSIS OF THE NEXUS BETWEEN DEFENCE SPENDING AND GROWTH IN THE EUROPEAN UNION: A COMMENT

Abstract

This paper explains and assesses the UK experience with determining prices and profitability for non-competitive defence contracts. Three periods are considered, namely pre-1968, the 1968 Profit Formula Agreement and the changes introduced in 2014. Two cases of ‘excessive’ profits were major determinants of the 1968 Profit Formula Agreement; but continued dissatisfaction with the 1968 Agreement led to changes in 2014. The historical overview of UK experience provides a basis for understanding current UK policy and offers insights for other countries facing similar policy challenges. A critique is presented of UK policy on single source pricing and profitability.     

基于CPLD与单片机的多路高精度数据采集系统设计

结合CPLD与单片机设计了一种多路高精度数据采集系统,最高可达24位转换精度。所采集数据具备良好的实时性,可采集通道数目多,同时系统具备较强的抗外界干扰能力,结构简单,可靠性好。该系统具有较强的可移植性,能够广泛应用于多路、高精度、低频数据采集的场合。     

FAE野外空中爆炸效应实验研究及其一次起爆机理探讨

野外进行1．8kg的FAE静爆实验,采用不同配方的纯固态燃料和液一固混合燃料与等质量的TNT对比分析。实验结果表明,FAE的爆炸效果明显优于等质量的TNT,而纯固态FAE爆炸性能强于液一固混合FAE;FAE爆炸后测到的超压分布呈现单调减趋势,这是由于测量点都分布在云爆区范围之外;FAE的云雾分散效果优于等质量的TNT装药,火焰持续时间也长。通过高速摄影图片看出,合适配方的纯固态无约束的FAE弹体火球的持续时间与有约束的液一固混合FAE弹体相当。分析了纯固态FAE爆炸后超压峰值时刻与火球最大直径时刻不同步的原因,探讨了纯固态FAE一次起爆机理。     

近程简易控制火箭末修的效率分析

阐述了脉冲控制力实施简易控制的特点,针对某近程单兵火箭建立了其弹道模型,在弹体周向布置两种大小不同的脉冲发动机,采用两种脉冲延时分级控制的控制策略对其实施简易控制,对其控制时刻、转速影响、分档设计等进行了分析证明对该单兵火箭实施简易控制是可行的.     

一种基于Jerk模型的机动目标单站无源定位算法

针对采用非线性较强的观测角、角度变化率、脉冲到达时间差等参数的单站无源定位跟踪系统,提出了一种新的跟踪滤波算法IMM-Jerk。该方法用Jerk模型对做复杂机动的运动目标建模,采用经过UKF滤波改进的交互多模(IMM)算法对目标实现跟踪滤波。该算法可适用于对做多种机动运动的目标的跟踪,提高了目标跟踪收敛精度和跟踪系统的稳定性。仿真试验证明了该方法的可行性和有效性,并具有较高的应用价值。最后,对IMM-Jerk算法的研究方向进行了讨论。     

On equivalence between the proportionate flow shop and single‐machine scheduling problems

We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015